Link capacity assignment in dynamic hierarchical networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks

Creation of a new link or increase in capacity of an existing link can reduce the efficiency of a congested network as measured by the total travel cost. This phenomenon, of which an extreme example is given by Braess’s paradox, has been examined in conventional studies within the framework of static assignment. For dynamic traffic assignment, which makes account of the effect of congestion thr...

متن کامل

Optimal capacity assignment in general queueing networks

We consider the problem of how best to assign the service capacity in a queueing network in order to minimise the expected delay under a cost constraint. We study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time dist...

متن کامل

Delay Constrained Routing and Link Capacity Assignment in Virtual Circuit Networks

An essential issue in designing, operating and managing a modern network is to assure end-to-end QoS from users perspective, and in the meantime to optimize a certain average performance objective from the systems perspective. So in the first part of this paper, we address the above issue by using the rerouting approach, where the objective is to minimize the average cross-network packet delay ...

متن کامل

Link Capacity Assignment in Packet-Switched Networks: The Case of Piecewise Linear Concave Cost Function

In this paper, we study the link capacity assignment problem in packet-switched networks (CA problem) focusing on the case where link cost function is a piecewise linear concave function. This type of cost function arises in many communication network design problems such as those arising from developments in communication transmission technologies. It is already known that the method of link s...

متن کامل

Artificial Intelligence Search Techniques for Discrete Link Capacity Assignment in Prioritized Multiservice Networks

In this paper, the discrete link capacity assignment problem for multiservice networks is considered. The discreteness of the link capacities is forced by the telecommunications equipment technology and vendors. Here, the designer is required to find the cheapest capacity assignment while satisfying the performance constraints for different classes of data originated by multiple services offere...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Networks and ISDN Systems

سال: 1988

ISSN: 0169-7552

DOI: 10.1016/0169-7552(88)90068-2